Complexity results for answer set programming with bounded predicate arities and implications
نویسندگان
چکیده
منابع مشابه
Complexity of Answer Set Checking and Bounded Predicate Arities for Non-ground Answer Set Programming
We present new complexity results on answer set checking for nonground programs under a variety of syntactic restrictions. For several of these problems, the kind of representation of the answer set to be checked is important. In particular, we consider set-based and bitmap-based representations, which are popular in implementations of Answer Set Programming systems. Furthermore, we present new...
متن کاملComplexity of Model Checking and Bounded Predicate Arities for Non-ground Answer Set Programming
Answer Set Programming has become a host for expressing knowledge representation problems, which reinforces the interest in efficient methods for computing answer sets of a logic program. While for propositional programs, the complexity of this task has been amply studied and is wellunderstood, less attention has been paid to the case of nonground programs, which is much more important from a K...
متن کاملEvaluation of Answer Set Programs with Bounded Predicate Arities
We consider the class of logic programs under the restriction of bounded predicate arities. Previous results showed that the complexity answer set semantics for such class of logic programs is lower than unrestricted programs. In particular, evaluation under answer set semantics is possible within polynomial space. However, current ASP solvers and grounders do not seem to respect this complexit...
متن کاملAnswer-Set Programming with Bounded Treewidth
In this paper, we present a novel approach to the evaluation of propositional answer-set programs. In particular, for programs with bounded treewidth, our algorithm is capable of (i) computing the number of answer sets in linear time and (ii) enumerating all answer sets with linear delay. Our algorithm relies on dynamic programming. Therefore, our approach significantly differs from standard AS...
متن کاملAnswer Set Programming and Bounded Model Checking
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. This is an extension of earlier work where bounded model checking has been used for verification of sequential digital circuits. As the model of asynchronous systems a generalization of communicating automata, 1-safe Petri nets, are used. A mapping fr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Mathematics and Artificial Intelligence
سال: 2007
ISSN: 1012-2443,1573-7470
DOI: 10.1007/s10472-008-9086-5